Compositional Design of Multitolerant Repetitive Byzantine Agreement
نویسندگان
چکیده
We illustrate in this paper a compositional and stepwise method for designing programs that o er a potentially unique tolerance to each of their fault-classes. More speci cally, our illustration is a design of a repetitive agreement program that o ers two tolerances: (a) it masks the e ects of Byzantine failures and (b) it is stabilizing in the presence of transient and Byzantine failures.
منابع مشابه
Compositional Design of Multitolerant Repetitive Byzantine Agreement 1
We illustrate in this paper a compositional and stepwise method for designing programs that ooer a potentially unique tolerance to each of their fault-classes. More speciically, our illustration is a design of a repetitive agreement program that ooers two tolerances: (a) it masks the eeects of Byzantine failures and (b) it is stabilizing in the presence of transient and Byzantine failures.
متن کاملFeasibility of Stepwise Addition of Multitolerance to High Atomicity Programs
We present sound and (deterministically) complete algorithms for stepwise design of two families ofmultitolerant programs in a high atomicity program model, where a program can read and write all itsvariables in an atomic step. We illustrate that if one needs to add failsafe (respectively, nonmasking)fault-tolerance to one class of faults and masking fault-tolerance to another c...
متن کاملDesigning Efficient Fail-Safe Multitolerant Systems
In this paper, we propose a method for designing efficient fail-safe multitolerant systems. A multitolerant system is one that is able to tolerate multiple types of faults, and a fail-safe multitolerant system handles the various fault types in a fail-safe manner. Efficiency issues of interest are fault tolerance-related, and they are: (i) completeness, and (ii) accuracy. Based on earlier work,...
متن کاملP Systems and the Byzantine Agreement Radu
We first propose a modular framework for recursive composition of P systems. This modular approach provides encapsulation and information hiding, facilitating the design of P programs for complex algorithms. Using this framework, we developed a P program that solves the classical version of the Byzantine agreement problem, for N participants connected in a complete graph, according to the well ...
متن کاملP systems and the Byzantine agreement
We first propose a modular framework for recursive composition of P systems. This modular approach provides encapsulation and information hiding, facilitating the design of P programs for complex algorithms. Using this framework, we developed a P program that solves the classical version of the Byzantine agreement problem, for N participants connected in a complete graph, according to the well ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997